package tree.structure.hashtree;

/**
 * @author: 26233
 * @create: 2022-08-02 10:13:41
 * @Description
 **/

public class HashTreeNode {

    private HashTreeNode[] nextNodes;
    private int level;
    private int v;
    private boolean empty;
    private boolean hasDelete;// 逻辑删除

    public HashTreeNode() {
    }

    public HashTreeNode(int v) {
        this.empty = true;
        this.v = v;
    }

    public HashTreeNode[] getNextNodes() {
        return nextNodes;
    }

    public void setNextNodes(HashTreeNode[] nextNodes) {
        this.nextNodes = nextNodes;
    }

    public int getLevel() {
        return level;
    }

    public void setLevel(int level) {
        this.level = level;
    }

    public int getV() {
        return v;
    }

    public void setV(int v) {
        this.v = v;
    }

    public boolean isEmpty() {
        return empty;
    }

    public void setEmpty(boolean empty) {
        this.empty = empty;
    }
}
